Magic Knight's Tours in Higher Dimensions

نویسنده

  • Awani Kumar
چکیده

A knight‟s tour on a board is a sequence of knight moves that visits each square exactly once. A knight‟s tour on a square board is called magic knight‟s tour if the sum of the numbers in each row and column is the same (magic constant). Knight‟s tour in higher dimensions (n > 3) is a new topic in the age-old world of knight‟s tours. In this paper, it has been proved that there can‟t be magic knight‟s tour or closed knight‟s tour in an odd order n-dimensional hypercube. 3 x 4 x 2 n-2 is the smallest cuboid (n ≥ 2) and 4 x 4 x 4 n-2 is the smallest cube in which knight‟s tour is possible in n-dimensions (n ≥ 3). Magic knight‟s tours are possible in 4 x 4 x 4 x 4 and 4 x 4 x 4 x 4 x 4 hypercube.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Knight's Tours in Higher Dimensions

In this paper we are concerned with knight’s tours on high-dimensional boards. Our main aim is to show that on the d-dimensional board [n], with n even, there is always a knight’s tour provided that n is sufficiently large. In fact, we give an exact classification of the grids [n1] × . . . × [nd] in which there is a knight’s tour. This answers questions of DeMaio, DeMaio and Mathew, and Watkins.

متن کامل

The Closed Knight Tour Problem in Higher Dimensions

The problem of existence of closed knight tours for rectangular chessboards was solved by Schwenk in 1991. Last year, in 2011, DeMaio and Mathew provide an extension of this result for 3-dimensional rectangular boards. In this article, we give the solution for n-dimensional rectangular boards, for n > 4.

متن کامل

Knight's Tours of an 8 8 Chessboard

We describe a computation that determined the number of knight's tours of a standard chessboard. We also verify Knuth's count of tours with a symmetry.

متن کامل

Generalised Knight's Tours

The problem of existence of closed knight’s tours in [n]d, where [n] = {0, 1, 2, . . . , n− 1}, was recently solved by Erde, Golénia, and Golénia. They raised the same question for a generalised, (a, b) knight, which is allowed to move along any two axes of [n]d by a and b unit lengths respectively. Given an even number a, we show that the [n]d grid admits an (a, 1) knight’s tour for sufficient...

متن کامل

Bounds on the Number of Knight's Tours

Knight’s tours are a fascinating subject. New lower bounds on the number of knight’s tours and structured knight’s tours on n x IZ chessboards and even n are presented. For the natural special case n = 8 a new upper bound is proved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1201.0458  شماره 

صفحات  -

تاریخ انتشار 2012